- parameter selection
- выбор параметров
Englsh-Russian aviation and space dictionary. - M.: Military publishing house USSR Ministry of Defence. edited by M. Murashkevich. 1974.
Englsh-Russian aviation and space dictionary. - M.: Military publishing house USSR Ministry of Defence. edited by M. Murashkevich. 1974.
Selection-Sort — Der Begriff Sortierlese oder Selection Sort (englisch selection »Auswahl«, to sort »sortieren«), auch MinSort (von Minimum) bzw. MaxSort (von Maximum), Selectsort oder ExchangeSort (AustauschSort) genannt, bezeichnet einen naiven… … Deutsch Wikipedia
Selection Sort — Der Begriff Sortierlese oder Selection Sort (englisch selection »Auswahl«, to sort »sortieren«), auch MinSort (von Minimum) bzw. MaxSort (von Maximum), Selectsort oder ExchangeSort (AustauschSort) genannt, bezeichnet einen naiven… … Deutsch Wikipedia
Hildebrand solubility parameter — The Hildebrand solubility parameter (δ) provides a numerical estimate of the degree of interaction between materials, and can be a good indication of solubility, particularly for non polar materials such as many polymers. Materials with similar… … Wikipedia
Named parameter — In computer programming, named parameters or keyword arguments refer to a computer language s support for function calls that clearly state the name of each parameter within the function call itself. Contents 1 Overview 2 Use in programming… … Wikipedia
Differential evolution — In computer science, differential evolution (DE) is a method that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. Such methods are commonly known as metaheuristics as they make… … Wikipedia
k-nearest neighbor algorithm — KNN redirects here. For other uses, see KNN (disambiguation). In pattern recognition, the k nearest neighbor algorithm (k NN) is a method for classifying objects based on closest training examples in the feature space. k NN is a type of instance… … Wikipedia
Metaheuristic — In computer science, metaheuristic designates a computational method that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. Metaheuristics make few or no assumptions about the… … Wikipedia
Rice distribution — Probability distribution name =Rice type =density pdf Rice probability density functions for various nu; with σ = 0.25. cdf Rice cumulative distribution functions for various nu; with σ = 0.25. parameters = uge 0, sigmage 0, support =xin… … Wikipedia
Метод роя частиц — (МРЧ) метод численной оптимизации, для использования которого не требуется знать точного градиента оптимизируемой функции. МРЧ был доказан Кеннеди, Эберхартом и Ши[1] [2] и изначально предназначался для имитации социального поведения.… … Википедия
Loi De Rice — En statistiques et théorie des probabilités, la loi de Rice est une loi statistique continue (c est à dire à densité). C est la loi que suit la racine carrée d une χ². Rice Densité de probabilité / Fonction de masse … Wikipédia en Français
Loi de Rice — En statistiques et théorie des probabilités, la loi de Rice est une loi statistique continue (c est à dire à densité). C est une généralisation de la loi de Rayleigh utilisée pour décrire le comportement d un signal radio qui se propage selon… … Wikipédia en Français